One-way reversible multi-head finite automata
نویسندگان
چکیده
منابع مشابه
Size of Unary One-Way Multi-head Finite Automata
One of the main topics of descriptional complexity is the question of how the size of the description of a formal language varies when being described by different formalisms. A fundamental result is the exponential trade-off between the number of states of nondeterministic (NFA) and deterministic finite automata (DFA) (see, for example, [12]). Additional exponential and double-exponential trad...
متن کاملOne-Way Reversible and Quantum Finite Automata with Advice
• This Talk is about • The roles of advice that is given to one-way finite automata. • In particular, for reversible automata and quantum automata. • What is New? • A new characterization of reversible automata using advice. • A new necessary condition for quantum automata with advice. • New separations among advised language families • Why is This Result New? • This extends the existing framew...
متن کاملA Simulation of Oblivious Multi-head One-way Finite Automata by Real-time Cellular Automata
In this paper, we present the simulation of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head one-way finite automata and is characterised by having its heads moving only forward, on a trajectory that only depends on the length of the input. While the original finite automaton works in linear time, its corresponding c...
متن کاملA Note On the Hierarchy of One-way Data-Independent Multi-Head Finite Automata
In this paper we deal with one-way multi-head data-independent finite automata. A k-head finite automaton A is data-independent, if the position of every head i after step t in the computation on an input w is a function that depends only on the length of the input w, on i and on t (i.e. the trajectories of heads must be the same on the inputs of the same length). It is known that k(k + 1)/2 + ...
متن کاملOne-Way Probabilistic Reversible and Quantum One-Counter Automata
Kravtsev introduced 1-way quantum 1-counter automata (1Q1CAs), and showed that several non-context-free languages can be recognized by bounded error 1Q1CAs. In this paper, we rst show that all of these non-context-free languages can be also recognized by bounded error 1PR1CAs (and so 1Q1CAs). Moreover, the accepting probability of each of these 1PR1CAs is strictly greater than, or at least equa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.11.006